Single-Machine Scheduling for Minimizing the Expected Total Cost Subject to Machine Breakdowns.
نویسندگان
چکیده
منابع مشابه
Minimizing Capacity Loss on Single Machine Scheduling Problems subject to Breakdowns and Preventive Maintenance
We analyze a one machine scheduling problem subject to breakdowns and preventive maintenance. The primary objective in this work is to minimize the capacity loss due to rework resulting from breakdowns and potential capacity loss due to unnecessary maintenance. We propose a model where the timeline is split into two alternating regions as risk free and risky regions by assuming that the machine...
متن کاملMinimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
متن کاملSingle Machine Scheduling Subject To Precedence Delays
A single-machine scheduling problem with precedence delays is analyzed. A set of n tasks is to be scheduled on the machine in such a way that the makespan is minimized. The executions of the tasks are constrained by precedence delays, i.e., a task can start its execution only after any of its predecessors has completed and the delay between the two tasks has elapsed. In the case of unit executi...
متن کاملScheduling n jobs and preventive maintenance in a single machine subject to breakdowns to minimize the expected total earliness and tardiness costs
This paper focuses on a stochastic scheduling problem in which n immediately available jobs are to be scheduled jointly with the preventive maintenance in a single machine subject to breakdowns. The objective is to minimize expected total earliness and tardiness costs with a common due-date. The problem of scheduling only n jobs to minimize total earliness and tardiness costs in a single machin...
متن کاملScheduling with Unexpected Machine Breakdowns
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job processing times are known in advance and preemption of jobs is allowed. Machines are non-continuously available, i.e., they can break down and recover at arbitrary time instances not known in advance. New machines may b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C
سال: 1993
ISSN: 0387-5024,1884-8354
DOI: 10.1299/kikaic.59.617